A Hybrid Co-evolutionary Particle Swarm Optimization Algorithm for Solving Constrained Engineering Design Problems

نویسندگان

  • Yongquan Zhou
  • Shengyu Pei
چکیده

This paper presents an effective hybrid coevolutionary particle swarm optimization algorithm for solving constrained engineering design problems, which is based on simulated annealing (SA) , employing the notion of co-evolution to adapt penalty factors. By employing the SAbased selection for the best position of particles and swarms when updating the velocity in co-evolutionary particle swarm optimization algorithm. Simulation results based on well-known constrained engineering design problems demonstrate the effectiveness, efficiency and robustness on initial populations of the proposed, and can reach a high precision.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems

Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...

متن کامل

Multi-objective Optimization with Combination of Particle Swarm and Extremal Optimization for Constrained Engineering Design

Engineering optimization problems usually have several conflicting objectives, such that no single solution can be considered optimum with respect to all objectives. In recent years, many efforts have focused on hybrid metaheuristic approaches for their robustness and efficiency to solve the above-mentioned multiobjective optimization problems (MOPs). This paper proposes a novel hybrid algorith...

متن کامل

Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems

Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...

متن کامل

Constrained Nonlinear Optimal Control via a Hybrid BA-SD

The non-convex behavior presented by nonlinear systems limits the application of classical optimization techniques to solve optimal control problems for these kinds of systems. This paper proposes a hybrid algorithm, namely BA-SD, by combining Bee algorithm (BA) with steepest descent (SD) method for numerically solving nonlinear optimal control (NOC) problems. The proposed algorithm includes th...

متن کامل

Particle swarm optimisation with stochastic ranking for constrained numerical and engineering benchmark problems

Most of the real world science and engineering optimisation problems are non-linear and constrained. This paper presents a hybrid algorithm by integrating particle swarm optimisation with stochastic ranking for solving standard constrained numerical and engineering benchmark problems. Stochastic ranking technique that uses bubble sort mechanism for ranking the solutions and maintains a balance ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JCP

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2010